Some new bounds on LCD codes over finite fields
نویسندگان
چکیده
In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n, 2) over F3 and F4. We study the bound of LCD codes over Fq.
منابع مشابه
On MDS Negacyclic LCD Codes
This paper is devoted to the study of linear codes with complementary-duals (LCD) arising from negacyclic codes over finite fields Fq, where q is an odd prime power. We obtain two classes of MDS negacyclic LCD codes of length n| q−1 2 , n| q+1 2 and a class of negacyclic LCD codes of length n = q+1. Also, we drive some parameters of Hermitian negacyclic LCD codes over Fq2 of length n = q − 1 an...
متن کاملGalois LCD codes over finite fields
In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized. Some illustrative examples which constacyclic codes are Galois LCD MDS codes are provided as well. In part...
متن کاملConstructions of optimal LCD codes over large finite fields
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.
متن کاملOn Hermitian LCD codes from cyclic codes and their applications to orthogonal direct sum masking
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. It was proved that asymptotically good Hermitian LCD codes exist. The objective of this paper is to construct some cyclic Hermitian LCD codes over finite fields and analyse their parameters. The dimensions of these codes ar...
متن کاملNew binary and ternary LCD codes
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality larger than 3. Hence, the study of LCD codes is mainly open for binary and ternary fields. Subfield-subcodes of $J$-affine variety codes are a generalization of B...
متن کامل